Theory Refinement on Bayesian Networks

نویسنده

  • Wray L. Buntine
چکیده

Theory refinement is the task of updating a domain theory in the light of new cases, to be done automatically or with some expert as­ sistance. The problem of theory refinement under uncertainty is reviewed here in the con­ text of Bayesian statistics, a theory of belief revision. The problem is reduced to an incre­ mental learning task as follows: the learning system is initially primed with a partial the­ ory supplied by a domain expert, and there­ after maintains its own internal representa­ tion of alternative theories which is able to be interrogated by the domain expert and able to be incrementally refined from data. Algo­ rithms for refinement of Bayesian networks are presented to illustrate what is meant by "partial theory", "alternative theory repre­ sentation", etc. The algorithms are an incre­ mental variant of batch learning algorithms from the literature so can work well in batch and incremental mode.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A refinement of the common cause principle

I study the interplay between stochastic dependence and causal relations within the setting of Bayesian networks and in terms of information theory. The application of a recently defined causal information flow measure provides a quantitative refinement of Reichenbach’s common cause principle.

متن کامل

Theory Refinement of Bayesian Logic Programs

Bayesian Logic Programs (BLP) [8][9] is a powerful and elegant framework for combining the expressiveness of first order logic with Bayesian networks. They can represent both Bayesian networks and logic programs, and their kernel in Prolog is an adaptation of an usual Prolog metainterpreter. It has been successfully compared to other such proposals in the literature. In this paper, we present a...

متن کامل

Learning Ground CP-logic Theories by means of Bayesian Network Techniques

Causal relationships are present in many application domains. CP-logic is a probabilistic modeling language that is especially designed to express such relationships. This paper investigates the learning of CP-theories from examples, and focusses on structure learning. The proposed approach is based on a transformation between CP-logic theories and Bayesian networks, that is, the method applies...

متن کامل

Policy Explanation and Model Refinement in Decision-Theoretic Planning

Decision-theoretic systems, such as Markov Decision Processes (MDPs), are used for sequential decision-making under uncertainty. MDPs provide a generic framework that can be applied in various domains to compute optimal policies. This thesis presents techniques that offer explanations of optimal policies for MDPs and then refine decision theoretic models (Bayesian networks and MDPs) based on fe...

متن کامل

On the complexity of belief network synthesis and refinement

Belief networks are important objects for research study and for actual use, as the experience of the MUNIN project demonstrates. There is evidence that humans are quite good at guessing network structure but poor at settling values for the numerical parameters. Determining these parameters by standard statistical techniques often requires too many sample points (test cases') for larger systems...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1991